Directed acyclic subsequence graph—Overview

Directed Acyclic Subsequence Graph for multiple texts

The subsequence matching problem is to decide, for given strings S and T , whether S is a subsequence of T. The string S is called pattern and the string T text. We consider the case of multiple texts and show how to solve the subsequence matching problem in time linear in the length of pattern. For this purpose we build the automaton that accepts all subsequences of given texts. The automaton ...

Generic Directed Acyclic Graphs

Copula directed acyclic graphs

We present a new methodology for selecting a Bayesian network for continuous data outside the widely used class of multivariate normal distributions. The use of bivariate copula densities to model connections between pairs of nodes in the network brings in flexibility in the choice of the distribution. Cand D-vines play a central role in dealing with the high-dimensional aspect of the data, due...

Use of Directed Acyclic Graphs

This supplement describes how counterfactual theory is used to define causal effects and the conditions in which observed data can be used to estimate counterfactual-based causal effects. Basic definitions and language used in causal graph theory are then presented. The graphical separation rules linking the causal assumptions encoded in a diagram to the statistical relations implied by the cau...

Analyzing Directed Acyclic Graph Recombination

This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described. As an experimental analysis indicates, a recombination operato...